Denotational Semantics for Probabilistic Refusal Testing

Denotational Semantics for Probabilistic Refusal Testing

In this paper, refusal testing ideas are applied to deene a testing semantics for a probabilistic process algebra. A testing equivalence is deened by combining the greater discriminatory power of refusal testing and a simple treatment of the prob-abilistic component of processes. This testing equivalence is characterized by two fully abstract denotational semantics. The rst of them is based on ...

Denotational Semantics for a Probabilistic Timed Shared-Variable Language

Testing Semantics for Probabilistic LOTOS

In this paper we present a probabilistic extension of LOTOS which is upward compatible with LOTOS. We present testing semantics for the reactive and generative models described in vGSST90]. While there is a certain lose of the meaning of probabilities in the reactive model, testing with probabilistic tests proves to be too strong, because it does not relate behavior expressions which we expect ...

A Denotational Semantics for Circus

Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to prove properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a fina...

A Denotational Semantics for Curry

We aim to build a denotational semantics for the functional logic programming language Curry, to be used for parametricity and logical relation arguments. First, we investigate only a subset of Curry, but include the important features that separate Curry from a just functional language. We compare a poweralgebraic and a multialgebraic semantic approach and motivate our decision for the multial...